Comparison of the Q-Routing and Shortest Path Routing Algorithms
نویسندگان
چکیده
In this paper, we compare the self-adaptive QRouting and dual reinforcement Q-Routing algorithms with the conventional shortest path routing algorithm. The Q-Routing algorithm embeds a learning policy at every node to adapt itself to the changing network conditions, which leads to a synchronised routing information, in order to achieve a shortest delivery time. Unlike Q-Routing, the shortest path routing algorithm routes the packets based on the link with the least delay irrespective of the traffic pattern on the link. Here simulations are carried out under problematic conditions by taking into account the node and link failures. Results show that the adaptive (learning) approach performed better than the traditional non-adaptive approach under problematic conditions.
منابع مشابه
A Novel Protection Guaranteed, Quality of Transmission Aware Routing and Wavelength Assignment Algorithm for All-optical Networks
Transparent All Optical Networks carry huge traffic and any link failure can cause the loss of gigabits of data; hence protection and its guarantee becomes necessary at the time of failure. Many protection schemes were presented in the literature, but none of them speaks about protection guarantee. Also, in all optical networks, due to absence of regeneration capabilities, the physical layer i...
متن کاملImprovement of Routing Operation Based on Learning with Using Smart Local and Global Agents and with the Help of the Ant Colony Algorithm
Routing in computer networks has played a special role in recent years. The cause of this is the role of routing in a performance of the networks. The quality of service and security is one of the most important challenges in routing due to lack of reliable methods. Routers use routing algorithms to find the best route to a particular destination. When talking about the best path, we consider p...
متن کاملImprovement of Routing Operation Based on Learning with Using Smart Local and Global Agents and with the Help of the Ant Colony Algorithm
Routing in computer networks has played a special role in recent years. The cause of this is the role of routing in a performance of the networks. The quality of service and security is one of the most important challenges in routing due to lack of reliable methods. Routers use routing algorithms to find the best route to a particular destination. When talking about the best path, we consider p...
متن کاملMANET with Q Routing Protocol
A Most of the routing algorithms are based on shortest path algorithms or distance vector or link state algorithms, they are not capable of adapting the run time changes such as traffic load, delivery time to reach to the destination etc, thus though provides shortest path, these shortest path may not be optimum path to deliver the packets. Optimum path can only be achieved when state of the ne...
متن کاملOptimum Routing in the Urban Transportation Network by Integrating Genetic Meta-heuristic (GA) and Tabu Search (Ts) Algorithms
Urban transportation is one of the most important issues of urban life especially in big cities. Urban development, and subsequently the increase of routes and communications, make the role of transportation science more pronounced. The shortest path problem in a network is one of the most basic network analysis issues. In fact, finding answers to this question is necessity for higher level ana...
متن کامل